Stability of directed Min-Max optimal paths
نویسندگان
چکیده
منابع مشابه
Stability of directed Min-Max optimal paths
The stability of directed Min-Max optimal paths in cases of change in the random media is studied. Using analytical arguments it is shown that when small perturbations are applied to the weights of the bonds of the lattice, the probability that the new Min-Max optimal path is different from the original Min-Max optimal path is proportional to t‖ , where t is the size of the lattice, and ν‖ is t...
متن کاملMin-max optimal public service system design
This paper deals with designing a fair public service system. To achieve fairness, various schemes are be applied. The strongest criterion in the process is minimization of disutility of the worst situated users and then optimization of disutility of the better situated users under the condition that disutility of the worst situated users does not worsen, otherwise called lexicographical minimi...
متن کاملOn the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
GivenagraphG = (V,E) andk source-sinkpairs{(s1, t1), . . . , (sk, tk)} with each si, ti ∈ V , the Min-Sum Disjoint Paths problem asks k disjoint paths to connect all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks also k disjoint paths to connect all source-sink pairs but with minimized length of the longest path. In this paper we show that the w...
متن کاملMin-max Time Consensus Tracking Over Directed Trees
In this paper, decentralized feedback control strategies are derived for min-max time consensus tracking of multi-agent systems with bounded inputs that are communicating over directed graphs. Each agent is a linear time invariant system with distinct and rational eigenvalues. The graph contains a directed spanning tree rooted at an agent which generates the reference trajectory for the other a...
متن کاملComplexity and Approximation Results for the Min-Sum and Min-Max Disjoint Paths Problems
Given a graph G = (V,E) and k source-sink pairs {(s1, t1), . . . , (sk, tk)} with each si, ti ∈ V , the Min-Sum Disjoint Paths problem asks to find k disjoint paths connecting all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks for k disjoint paths connecting all the sourcesink pairs with minimized length of the longest path. We show that the wei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Europhysics Letters (EPL)
سال: 2007
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/77/20003